Magic Squares and Sudoku

نویسنده

  • John Lorch
چکیده

We introduce a family of magic squares, called linear magic squares, and show that any parallel linear sudoku solution of sufficiently large order can be relabeled so that all of its subsquares are linear magic. As a consequence, we show that if n has prime factorization p1 1 · · · p kt t and q = min{p k j j | 1 ≤ j ≤ t}, then there is a family of q(q − 1) mutually orthogonal magic sudoku solutions of order n2 whenever q > 3; such an orthogonal family is complete if n is a prime power.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Signatura of Magic and Latin Integer Squares: Isentropic Clans and Indexing

The 2010 study of the Shannon entropy of order nine Sudoku and Latin square matrices by Newton and DeSalvo [Proc. Roy. Soc. A 2010] is extended to natural magic and Latin squares up to order nine. We demonstrate that decimal and integer measures of the Singular Value sets, here named SV clans, are a powerful way of comparing different integer squares. Several complete sets of magic and Latin sq...

متن کامل

Modular magic sudoku

A modular magic sudoku solution is a sudoku solution with symbols in {0, 1, ..., 8} such that rows, columns, and diagonals of each subsquare add to zero modulo nine. We count these sudoku solutions by using the action of a suitable symmetry group and we also describe maximal mutually orthogonal families.

متن کامل

Nest graphs and minimal complete symmetry groups for magic Sudoku variants

Felgenhauer and Jarvis famously showed in [2], although it was first mentioned earlier, in [7], that there are 6,670,903,752,021,072,936,960 possible completed Sudoku boards. In a later paper, Jarvis and Russell [8] used a Sudoku symmetry group of size 3, 359, 232 · 9! = 1, 218, 998, 108, 160 and Burnside’s Lemma to show that there are 5,472,730,538 essentially different Sudoku boards. Both of ...

متن کامل

Orthogonal latin squares of Sudoku type

Orthogonal latin squares of Sudoku type Hans-Dietrich Gronau Universität Rostock, Inst. für Mathematik 18051 Rostock, Germany We present results on the existence of orthogonal latin squares and latin rectangles of Sudoku type.

متن کامل

Constructions of complete sets of orthogonal diagonal Sudoku squares

We prove that complete sets of orthogonal diagonal Sudoku latin squares (sometimes called Sudoku frames) exist of all orders p, where p is a prime. We also show that complete sets of orthogonal Sudoku frames which are left semi-diagonal exist of all orders p, s > 1. We conjecture that these may be right semi-diagonal also but we do not have a general proof. We show how these complete sets may b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • The American Mathematical Monthly

دوره 119  شماره 

صفحات  -

تاریخ انتشار 2012